Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata

In this paper we introduce a sub-family of synchronized alternating pushdown automata, one-turn Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by Linear Conjunctive Grammars. This equivalence is analogues to the classical equivalence between one-turn PDA and Linear Grammars, thus strengthening the claim of Synchronized Alternating Pushdown Automata as a natural counterpart for Conjunctive Grammars.